Technical Note—New Sufficient Conditions for (s, S) Policies to be Optimal in Systems with Multiple Uncertainties
نویسندگان
چکیده
منابع مشابه
An Efficient Algorithm for Computing Optimal (s, S) Policies
This paper presents an algorithm to compute an optimal (s, S) policy under standard assumptions (stationary data, well-behaved one-period costs, discrete demand, full backlogging, and the average-cost criterion). The method is iterative, starting with an arbitrary, given (s, S) policy and converging to an optimal policy in a finite number of iterations. Any of the available approximations can t...
متن کاملNecessary and Sufficient Conditions for S-hopfian Manifolds to Be Codimension-2 Fibrators
Fibrators help detect approximate fibrations. A closed, connected n-manifold N is called a codimension-2 fibrator if each map p : M → B defined on an (n + 2)-manifold M such that all fibre p−1(b), b ∈ B, are shape equivalent to N is an approximate fibration. The most natural objects N to study are s-Hopfian manifolds. In this note we give some necessary and sufficient conditions for s-Hopfian m...
متن کاملComputing globally optimal (s,S,T) inventory policies
We consider a single-echelon inventory installation under the (s,S,T) periodic review ordering policy. Demand is stationary random and, when unsatisfied, is backordered. Under a standard cost structure, we seek to minimize total average cost in all three policy variables; namely, the reorder level s, the order-up-to level S and the review interval T. Considering time to be continuous, we first ...
متن کاملOptimal and Near-Optimal ( s, S) Inventory Policies for Levy Demand Processes
A is a continuous-time, real-valued stochastic process which has independent and Levy jump process stationary increments, with no Brownian component. We study some of the fundamental properties of Levy jump processes and develop inventory models for them. Of particular interest to us is the gamma-distributed Levy process, in which the demand that occurs in a fixed period of time has a gamma dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2015
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.2014.1335